Thai monophthong recognition using continuous density hidden Markov model and LPC cepstral coefficients

نویسندگان

  • Ekkarit Maneenoi
  • Somchai Jitapunkul
  • Visarut Ahkuputra
  • Umavasee Thathong
  • Boonchai Thampanitchawong
  • Sudaporn Luksaneeyanawin
چکیده

This paper presents Thai monophthongs recognition. The monophthongs were qualitatively recognized by the 3-state leftto-right continuous density hidden Markov model. The LPC cepstral coefficients were used as feature which represented specch signal. The temporal cepstral derivative was additionally utilized in order to compare efficiency of the additional feature with that of the single LPC cepstral coefficients. The number of coefficient orders was varied in order to determine an appropriate order. Thai single, double, and triple polysyllabic words were used in this research. The 18 monophthongs from the polysyllabic words were qualitatively recognized as 9 different vowels. The highest recognition rate of the single feature obtained from 18-order LPC cepstral coefficient is 86.983 percent, while the recognition rate of the 16-order LPC cepstral coefficient accompanied by temporal derivative is 94.580 percent. The misclassification is examined and concluded that this resulted from excessively overlapped distributions of vowels in low and in back vowel group respectively.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DWT and LPC based feature extraction methods for isolated word recognition

In this article, new feature extraction methods, which utilize wavelet decomposition and reduced order linear predictive coding (LPC) coefficients, have been proposed for speech recognition. The coefficients have been derived from the speech frames decomposed using discrete wavelet transform. LPC coefficients derived from subband decomposition (abbreviated as WLPC) of speech frame provide bette...

متن کامل

Comparative Study of Continuous Hidden Markov Models (CHMM) and Artificial Neural Network (ANN) on Speaker Identification System

This paper reports a comparative study between continuous hidden Markov model (CHMM) and artificial neural network (ANN) on text dependent, closed set speaker identification (SID) system with Thai language recording in office environment. Thai isolated digit 0-9 and their concatenation are used as speaking text. Mel frequency cepstral coefficients (MFCC) are selected as the studied features. Tw...

متن کامل

New Feature Extraction Techniques for Marathi Digit Recognition

In this paper a new efficient feature extraction methods for speech recognition have been proposed. The features are obtained from Cepstral Mean Normalized reduced order Linear Predictive Coding (LPC) coefficients derived from the speech frames decomposed using Discrete Wavelet Transform (DWT). In the literature it is assumed that the speech frame of size 10 msec to 30 msec is stationary, howev...

متن کامل

Automatic Speech Recognition in GSM Network Using the Bit-Stream and Auxiliary parameters

The Global System for Mobile (GSM) environment includes three main problems for Automatic Speech Recognition (ASR) systems: noisy scenarios, source coding distortion and transmission errors.The second, source coding distortion must be explicitly addressed.The front-end of the speech recognition system combines feature extracted by converting the quantized spectral information of speech coder, p...

متن کامل

A comparison of LPC and FFT-based acoustic features for noise robust ASR

Within the context of robust acoustic features for automatic speech recognition (ASR), we evaluated mel-frequency cepstral coefficients (MFCCs) derived from two spectral representation techniques, i.e. the fast Fourier transform (FFT) and linear pre­ dictive coding (LPC). ASR systems based on the two feature types were tested on a digit recognition task using continuous density hidden Markov ph...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000